Maximum Portfolio: A Query Condition Optimization Method

نویسندگان

  • Zhi Yang
  • Budan Wu
  • Junliang Chen
  • Pingli Gu
چکیده

Web Service is becoming the next generation of web-based application. With enhancement of quality of services and increasing quantity of services, service discovery becomes important. In the process of discovery, although the user is not familiar with service interfaces, he wants to obtain the best services with some limited simple keywords. Because the keywords are often incomplete or wrong or fuzzy to match with the services in service library, it is difficult to get the satisfying services. This paper provides an approach named as Maximum portfolio to deal with the problem. The aim of maximum portfolio is that the suitable composition is found out from ambiguous input keyword set. The improved service matching algorithm is proposed and applied to the Service Generating Platform. The result of experiment shows the algorithm can improve efficiency of service discovery.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robustness-based portfolio optimization under epistemic uncertainty

In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...

متن کامل

Three steps method for portfolio optimization by using Conditional Value at Risk measure

Comprehensive methods must be used for portfolio optimization. For this purpose, financial data of stock companies, inputs and outputs variable, the risk measure and investor’s preferences must be considered. By considering these items, we propose a method for portfolio optimization. In this paper, we used financial data of companies for screening the stock companies. We used Conditional Value ...

متن کامل

A Maximum Entropy Method for a Robust Portfolio Problem

We propose a continuous maximum entropy method to investigate the robust optimal portfolio selection problem for the market with transaction costs and dividends. This robust model aims to maximize the worst-case portfolio return in the case that all of asset returns lie within some prescribed intervals. A numerical optimal solution to the problem is obtained by using a continuous maximum entrop...

متن کامل

Comparison of the Accuracy of Black Hole Algorithms and Gravitational Research and the Hybrid Method in Portfolio Optimization

The main purpose of this research is portfolio optimization in Tehran securities exchange using the black hole algorithm and the Gravitational Research algorithm. We also propose an algorithm named Hybrid Algorithm which combines the two algorithms above to cover the weaknesses of these two algorithms. Finally we compare the results with the Markowitz model and choose the optimal algorithm.<br ...

متن کامل

Portfolio Optimization Based on Cross Efficiencies By Linear Model of Conditional Value at Risk Minimization

Markowitz model is the first modern formulation of portfolio optimization problem. Relyingon historical return of stocks as basic information and using variance as a risk measure aretow drawbacks of this model. Since Markowitz model has been presented, many effortshave been done to remove theses drawbacks. On one hand several better risk measures havebeen introduced and proper models have been ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011